Dynamic Geometric Data Structures via Shallow Cuttings

Sequential Dependency Computation via Geometric Data Structures

We are given integers 0 ≤ G1 ≤ G2 6= 0 and a sequence SN = 〈a1, a2, ..., aN 〉 of N integers. The goal is to compute the minimum number of insertions and deletions necessary to transform SN into a valid sequence, where a sequence is valid if it is nonempty, all elements are integers, and all the differences between consecutive elements are between G1 and G2. For this problem from the database th...

Dynamic Data Structures for Geometric Search and Retrieval

Title of dissertation: DYNAMIC DATA STRUCTURES FOR GEOMETRIC SEARCH AND RETRIEVAL Eunhui Park, 2013 Dissertation directed by: Professor David M. Mount Department of Computer Science Data structures for geometric search and retrieval are of significant interest in areas such as computational geometry, computer graphics, and computer vision. The focus of this dissertation is on the design of effi...

External Geometric Data Structures

Many modern applications store and process datasets much larger than the main memory of even state-of-the-art high-end machines. Thus massive and dynamically changing datasets often need to be stored in space efficient data structures on external storage devices such as disks, and in such cases the Input/Output (or I/O) communication between internal and external memory can become a major perfo...

Geometric Data Structures

Geometric Data Structures for Games: Index Structures

Index Structures: We continue our discussion of useful geometric data structure for computer games. So far we have discussed data structures for representing meshes (and more generally, cell complexes), geometric graphs (such as the visibility graph, θ-graph), and spatial subdivisions (such as the Delaunay triangulation). Usually, when we think of data structures for 1-dimensional data (such as...